combinatorial complexity

См. также в других словарях:

• Combinatorial optimization — In applied mathematics and theoretical computer science, combinatorial optimization is a topic that consists of finding an optimal object from a finite set of objects.[1] In many such problems, exhaustive search is not feasible. It operates on… …   Wikipedia

• Combinatorial game theory — This article is about the theory of combinatorial games. For the theory that includes games of chance and games of imperfect knowledge, see Game theory. Mathematicians playing Konane at a Combinatorial game theory workshop (for technical content …   Wikipedia

• Combinatorial auction — A combinatorial auction is a type of smart market in which participants can place bids on combinations of discrete items, or “packages,” rather than just individual items or continuous quantities. Simple combinatorial auctions have been used for… …   Wikipedia

• Combinatorial explosion — For other uses, see Combinatorial explosion (communication). In mathematics a combinatorial explosion describes the effect of functions that grow very rapidly as a result of combinatorial considerations.[1] Examples of such functions include the… …   Wikipedia

• Game complexity — Combinatorial game theory has several ways of measuring game complexity. This article describes five of them: state space complexity, game tree size, decision complexity, game tree complexity, and computational complexity. Contents 1 Measures of… …   Wikipedia

• Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… …   Wikipedia

• Communication complexity — The notion of communication complexity was introduced by Yao in 1979,[1] who investigated the following problem involving two separated parties (Alice and Bob). Alice receives an n bit string x[clarification needed] and Bob another n bit string… …   Wikipedia

• Time complexity — In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O… …   Wikipedia

• Average-case complexity — For deterministic algorithms, the average case complexity (expected time complexity), associates a given input distribution with the expected time of an algorithm.Leonid Levin presented the motivation for studying average case complexity as… …   Wikipedia

• Neural modeling fields — Neural modeling field (NMF) is a mathematical framework for machine learning which combines ideas from neural networks, fuzzy logic, and model based recognition. It has also been referred to as modeling fields, modeling fields theory (MFT),… …   Wikipedia

• Action selection — is a way of characterizing the most basic problem of intelligent systems: what to do next. In artificial intelligence and computational cognitive science, the action selection problem is typically associated with intelligent agents and animats… …   Wikipedia